A General Weighted Grammar Library
نویسندگان
چکیده
We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and utilities of this library and point out in each case their application to several text and speech processing tasks.
منابع مشابه
Weighted Grammar Tools: the Grm Library
We describe the algorithmic and software design principles of a general grammar library designed for use in spoken-dialogue systems, speech synthesis, and other speech processing applications. The library is a set of general-purpose software tools for constructing and modifying weighted finite-state acceptors and transducers representing grammars. The tools can be used in particular to compile ...
متن کاملThe design principles and algorithms of a weighted grammar library
We present the software design principles, algorithms, and utilities of a general weighted grammar library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. Several of the algorithms and utilities of this library are described, including in some cases their pseudocodes and pointers to their use in applications. The algorithms and the ut...
متن کاملPynini: A Python library for weighted finite-state grammar compilation
We present Pynini, an open-source library for the compilation of weighted finitestate transducers (WFSTs) and pushdown transducers (PDTs) from strings, contextdependent rewrite rules, and recursive transition networks. Pynini uses the OpenFst library for encoding, modifying, and applying WFSTs and PDTs. We describe the design of this library and the algorithms and interfaces used for compilatio...
متن کاملWeighted Finite - State Transducers inSpeech
We survey the use of weighted nite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-dependency, pronunciation dictionaries , grammars, and alternative recognition outputs. Furthermore, general transducer operations combine these representations exibly and ee-ciently. Weighted determinization and minimization ...
متن کاملPopularity Weighted Ranking for Academic Digital Libraries
We propose a popularity weighted ranking algorithm for academic digital libraries that uses the popularity factor of a publication venue overcoming the limitations of impact factors. We compare our method with the naive PageRank, citation counts and HITS algorithm, three popular measures currently used to rank papers beyond lexical similarity. The ranking results are evaluated by discounted cum...
متن کامل